Dynamic Bounds on Stochastic Chemical Kinetic Systems Using Semidefinite Programming
نویسندگان
چکیده
The method of moments has been proposed as a potential means to reduce the dimensionality of the chemical master equation (CME) appearing in stochastic chemical kinetics. However, attempts to apply the method of moments to the CME usually result in the so-called closure problem. Several authors have proposed moment closure schemes, which allow them to obtain approximations of quantities of interest, such as the mean count of molecules of each species. However, these approximations have the dissatisfying feature that they come with no error bounds. Recently, a method was proposed for calculating rigorous bounds on quantities of interest for stochastic chemical kinetic systems at steady state. In particular, the method used semidefinite programming to calculate bounds on mean molecular counts, variances in these counts, and probability histograms. In this paper, we extend that idea to the associated dynamic problem – calculating rigorous time-varying bounds on means and variances.
منابع مشابه
Modelling and Decision-making on Deteriorating Production Systems using Stochastic Dynamic Programming Approach
This study aimed at presenting a method for formulating optimal production, repair and replacement policies. The system was based on the production rate of defective parts and machine repairs and then was set up to optimize maintenance activities and related costs. The machine is either repaired or replaced. The machine is changed completely in the replacement process, but the productio...
متن کاملRigorous bounds on the stationary distributions of the chemical master equation via mathematical programming
The stochastic dynamics of networks of biochemical reactions in living cells are typically modelled using chemical master equations (CMEs). The stationary distributions of CMEs are seldom solvable analytically, and few methods exist that yield numerical estimates with computable error bounds. Here, we present two such methods based on mathematical programming techniques. First, we use semidefin...
متن کاملA Multi-Stage Single-Machine Replacement Strategy Using Stochastic Dynamic Programming
In this paper, the single machine replacement problem is being modeled into the frameworks of stochastic dynamic programming and control threshold policy, where some properties of the optimal values of the control thresholds are derived. Using these properties and by minimizing a cost function, the optimal values of two control thresholds for the time between productions of two successive nonco...
متن کاملApproximate Dynamic Programming via Iterated Bellman Inequalities
In this paper we introduce new methods for finding functions that lower bound the value function of a stochastic control problem, using an iterated form of the Bellman inequality. Our method is based on solving linear or semidefinite programs, and produces both a bound on the optimal objective, as well as a suboptimal policy that appears to works very well. These results extend and improve boun...
متن کاملAnalyzing Queuing Systems with Coupled Processors through Semidefinite Programming
We consider queuing systems with coupled processors, where the service rate at each queue varies depending on the set of queues in the system with non-zero queue lengths. In general, such queuing systems are very difficult to analyze and steady state queue length distributions are known only for two-queue systems. The coupled-processors model arises naturally in the study of several systems whe...
متن کامل